Time Matters: Minimizing Garbage Collection Overhead with Minimal Effort
نویسندگان
چکیده
Parameterization of garbage collectors can help improving the overall run time of programs, but finding the best parameter combination is a tedious task. We used a simple brute-force optimization algorithm for the Java Parallel GC to study the behavior of benchmarks with thousands of configurations. As a result of this study, we propose a practically usable strategy for finding a “good” parameter combination with a small number of experiments. Using this strategy, only 10 configurations need to be tested in order to reduce the garbage collection time down to 21% (56% on average). For the studied benchmarks, this results in an overall performance gain of up to 13%.
منابع مشابه
A Program Context-Aware Data Separation Technique for Reducing Garbage Collection Overhead in NAND Flash Memory
For NAND flash memory-based systems, garbage collection remains a major performance bottleneck. To decrease the garbage collection overhead, data separation techniques based on update frequency are widely used. However, from our observations using the oracle predictor on data update times, separating data by their update times rather than data with high update frequencies is a more important fa...
متن کاملA Distributed Garbage Collection Algorithm
Concurrent Scheme extends the Scheme programming language, providing parallel program execution on a distributed network. The Concurrent Scheme environment requires a garbage collector to reclaim global objects; objects that exist in a portion of the global heap located on the node that created them. Because a global object may be referenced by several nodes, traditional garbage collection algo...
متن کاملThe Metronome: A Simpler Approach to Garbage Collection in Real-Time Systems
With the wide-spread adoption of Java, there is significant interest in using the language for programming real-time systems. The community has generally viewed a truly real-time garbage collector as being impossible to build, and has instead focused its efforts on adding manual memory management mechanisms to Java. Unfortunately, these mechanisms are an awkward fit for the language: they intro...
متن کاملDistributed Garbage Collection by Timeouts and Backward Inquiry
We present a practical and e cient garbage collection mechanism for large scale distributed systems The mechanism collects all garbage including distributed cyclic garbage without global synchronization or back ward links The primary method used for local and remote garbage collection is timeouts each object has a time to live and clients which have a link to an ob ject must refresh the target ...
متن کاملLifetime-Based Memory Management for Distributed Data Processing Systems
In-memory caching of intermediate data and eager combining of data in shuffle buffers have been shown to be very effective in minimizing the re-computation and I/O cost in distributed data processing systems like Spark and Flink. However, it has also been widely reported that these techniques would create a large amount of long-living data objects in the heap, which may quickly saturate the gar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Softwaretechnik-Trends
دوره 35 شماره
صفحات -
تاریخ انتشار 2015